منابع مشابه
Enumeration of P 4-Free Chordal Graphs
We count labelled chordal graphs with no induced path of length 3, both exactly and asymptotically. These graphs correspond to rooted trees in which no vertex has exactly one child, and each vertex has been expanded to a clique. Some properties of random graphs of this type are also derived. The corresponding unlabelled graphs are in 1-1 correspondence with unlabelled rooted trees on the same n...
متن کامل4-regular claw-free IM-extendable graphs
A graph G is induced matching extendable (shortly, IM-extendable), if every induced matching of G is included in a perfect matching of G. A graph G is claw-free, if G does not contain any induced subgraph isomorphic toK1,3. The kth power of a graphG, denoted byGk , is the graph with vertex set V (G) in which two vertices are adjacent if and only if the distance between them in G is at most k. I...
متن کامل4-colorability of P6-free graphs
In this paper we will study the complexity of 4-colorability in subclasses of P6-free graphs. The well known k-colorability problem is NP -complete. It has been shown that if k-colorability is solvable in polynomial time for an induced H-free graph, then every component of H is a path. Recently, Huang [11] has shown several improved complexity results on k-coloring Pt-free graphs, where Pt is a...
متن کاملStructure of W 4 - immersion free graphs ?
We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.
متن کاملPancyclicity of 4-Connected, Claw-Free, P10-Free Graphs
A graph G is said to be pancyclic if G contains cycles of all lengths from 3 to |V (G)|. We show that if G is 4-connected, claw-free, and P10-free, then G is either pancyclic or it is the line graph of the Petersen graph. This implies that every 4-connected, claw-free, P9-free graph is pancyclic, which is best possible and extends a result of Gould et al. Pancyclicity in 3-connected graphs: Pai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.03.011